Applied Probability Trust (9 May 2010) PROBABILISTIC ANALYSIS OF THE K-SERVER PROBLEM ON THE CIRCLE
نویسندگان
چکیده
We consider a stochastic version of the k-server problem, in which k servers move on a circle to satisfy randomly generated requests. The requests are independent and identically distributed, according to an arbitrary distribution that is either discrete or continuous. The cost of serving a request is the distance that a server needs to travel in order to reach the request. The goal is to minimize the steady-state expected cost induced by the sequence of requests. We study the performance of a greedy strategy focusing, in particular, on its convergence properties and the interplay between the discrete and continuous versions of the process. Finally, we show that in the case of k = 2 servers the greedy policy is optimal.
منابع مشابه
Maximal Benefit Location Problem for A Congested System
Some servers are to be located at nodes of a network. Demand for services of these servers is located at each node and a subset of the nodes is to be chosen to locate one server in each. Each customer selects a server with a probability dependent on distance and a certain amount of benefit is achieved after giving service to the customer. Customers may waive receiving service with a known prob...
متن کاملProbabilistic Analysis of the K-server Problem on the Circle
We consider a stochastic version of the k-server problem, in which k servers move on a circle to satisfy randomly generated requests. The requests are independent and identically distributed, according to an arbitrary distribution that is either discrete or continuous. The cost of serving a request is the distance that a server needs to travel in order to reach the request. The goal is to minim...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملWorking Vacation Queue with Second Optional Service and Unreliable Server
An M/M/1 queueing system with second optional service and unreliable server is studied. We consider that the server works at different rate rather than being idle during the vacation period. The customers arrive to the system according to Poisson process with state dependent rates depending upon the server’s status. All customers demand the first essential service whereas only some of them dema...
متن کاملSupport vector regression with random output variable and probabilistic constraints
Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...
متن کامل